Experimental Evaluation of Load Balancers in Packet Processing Systems
نویسندگان
چکیده
The load balancer is a fundamental building block for implementing high-throughput applications on multi-core architectures (e.g., network processors). In this paper, we consider two canonical load balancing schemes in the context of packet processing systems: (1) packet-level load balancing that determines the mapping of a packet to processor independently for each packet; and (2) flow-level load balancing that maps a flow to a processor and directs all subsequent packets of that flow to the mapped processor. By identifying the application, system, and trace characteristics that affect their relative performance, we address the fundamental question: under what operating conditions, should one choose packet-level load balancing over flow-level load balancing, and vice versa?
منابع مشابه
Niagara: Scalable Load Balancing on Commodity Switches
Internet service providers rely on load balancers to distribute client requests for many web services over backend servers. Dedicated load-balancer appliances are expensive and do not scale easily with traffic demand. Instead, future load balancers should be built from smaller commodity components. Rather than rely exclusively on specialpurpose load-balancing software, we argue that data center...
متن کاملDirect Web switch routing with state migration, TCP masquerade, and cookie name rewriting
Existing layer 4 load balancers are content-blind and often have difficulty in redirecting HTTP requests to the appropriate server in the session manner. Layer 7 load balancers, also referred to as web switches, are content-aware and support session persistence. However, most web switches employ a bidirection architecture, which means both request and response traffic must both pass through the...
متن کاملA Semi-Distributed Load Balancing Model for Parallel Real-time Systems
We propose static and dynamic load balancing policies for parallel real time sys tems A parallel real time system in this context is considered as a computational environment consisting of a number of processors where stringent timing require ments of processes should be met This would encompass massively parallel systems at one end of the spectrum and a group of computers connected by a local ...
متن کاملAn Experimental Analysis of Counting Networks∗
Counting networks are highly distributed data structures that provide low contention solutions to distributed coordination problems. Counting networks are structured with balancers interconnected in a networked fashion. We study experimentally (with simulations and real implementation) the performance of counting networks according to three criteria: (i) The way the balancers are distributed am...
متن کاملEmbark: Securely Outsourcing Middleboxes to the Cloud
It is increasingly common for enterprises and other organizations to outsource network processing to the cloud. For example, enterprises may outsource firewalling, caching, and deep packet inspection, just as they outsource compute and storage. However, this poses a threat to enterprise confidentiality because the cloud provider gains access to the organization’s traffic. We design and build Em...
متن کامل